Pattern Matching of Parallel Values in Bulk Synchronous Parallel ML

New syntax of a High-level BSP language Application to parallel pattern-matching and exception handling

Bulk-Synchronous Parallel (BSP) ML is a high-level language for programming parallel algorithms. Built upon OCaml, it provides a safe setting for the implementation of BSP algorithms and avoiding concurrency related problems (deadlocks, indeterminism etc.). Currently, BSML is based on a very small core of parallel primitives that extended ML sequential programming to BSP one. But we found that ...

Communication-Efficient Bulk Synchronous Parallel Algorithm for Parentheses Matching

Implementation of the Parallel Superposition in Bulk-Synchronous Parallel ML

Bulk-Synchronous Parallel ML (BSML) is a functional dataparallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, avoids deadlocks and nondeterminism. This paper presents the implementation of a new primitive for BSML which can express divide-and-conquer algorithms.

Parallel I/O in Bulk-Synchronous Parallel ML

Bulk Synchronous Parallel ML or BSML is a functional dataparallel language for programming bulk synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and indeterminism are avoided. For large scale applications where parallel processing is helpful and where the total amount of data often exceeds the total main memory available, parallel disk I/O becomes a nece...

Semantics of Minimally Synchronous Parallel ML

This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and dead-locks and indeterminism are avoided. It shares with Bulk Synchronous Parallel ML its syntax and high-level semantics but it has a minimally synchronous distributed semantics. Programs are written as usual ML programs but using a small set of additional fun...